Minimum cut - PDFSEARCH.IO - Document Search Engine

Minimum cut
Results: 173

#	Item
31	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and † Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-31 22:48:01 Spanning tree Network flow Graph connectivity Maximum flow problem Randomized algorithm Minimum spanning tree Connectivity Cut SL Theoretical computer science Graph theory Mathematics
32	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
33	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:11 Theoretical computer science Maximum flow problem Flow network Minimum-cost flow problem Ford–Fulkerson algorithm Edmonds–Karp algorithm Shortest path problem Matching Max-flow min-cut theorem Graph theory Mathematics Network flow
34	Thesis for the degree ‫עבודת גמר (תזה) לתואר‬ Master of Science Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-22 08:25:27 Combinatorial optimization NP-complete problems Cut Streaming algorithm Maximum cut Hypergraph Time complexity Minimum cut Matching Theoretical computer science Graph theory Mathematics
35	The Romney Tax Plan Urban-Brookings Tax Policy Center March 1, 2012 In his campaign for the Republican presidential nomination, Mitt Romney has proposed permanently extending thetax cuts, further cutting individ Add to Reading List Source URL: taxpolicycenter.org Language: English - Date: 2012-03-01 14:54:25 Political economy Economic policy Alternative Minimum Tax Income tax in the United States Income tax in Australia Income tax Tax cut Estate tax in the United States Dividend tax Taxation in the United States Taxation Public economics
36	Flows Advanced Algorithms – COMS31900 G = (V, E) is a directed graph with two special vertices s and t, where s is the source and t is the target. We write u → v to denote the directed edge from u to v . Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Combinatorial optimization Maximum flow problem Flow network Ford–Fulkerson algorithm Max-flow min-cut theorem Cut Minimum cut Shortest path problem Network flow Graph theory Mathematics
37	7 CUT TWO STRINGERS of calculated length from 300 x 50 mm DAR purchased. Examplemm each piece, at least. Example Tread length 900 mm Minimum concrete slab 1200 x 300 x 100 mm Distance between centres of brackets Add to Reading List Source URL: www.cairnshardware.com.au Language: English - Date: 2014-10-02 01:41:22 Stairway Concrete Formwork Framing Stringer Lumber Longeron Architecture Construction Building engineering
38	Algorithms for Placing Monitors in a Flow Network (Preliminary Version) Francis Chin1, , Marek Chrobak2, , and Li Yan2, 1 Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2013-09-02 22:22:25 NP-complete problems Graph connectivity Graph Multigraph Bridge Minimum k-cut Line graph Graph coloring Graph theory Mathematics Theoretical computer science
39	Looking Inside the Labor Market: A Review Article* By Peter Howitt Brown University When unemployed workers are available, why don’t firms cut wages until the excess supply is eliminated, as would happen in the ideal m Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2002-04-15 11:08:29 Labor economics Economic theories Real rigidity Minimum wage Efficiency wage Keynesian economics Wage Unemployment Labour economics Macroeconomics Economics New Keynesian economics
40	Spectral sparsification via random spanners [Extended Abstract] ∗ Michael Kapralov Stanford iCME Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Combinatorial optimization Connectivity Minimum cut Cut Bridge Randomized algorithm Graph theory Graph connectivity Mathematics